Treelike Snarks
نویسندگان
چکیده
In this talk we present snarks whose edges cannot be covered by fewer than five perfect matchings. Esperet and Mazzuoccolo found an infinite family of such snarks, generalising an example provided by Hägglund. We construct another infinite family, arising from a generalisation in a different direction. The proof that this family has the requested property is computer-assisted. In addition, we prove that the snarks from this family (we call them treelike snarks) have circular flow number φC(G) ≥ 5 and admit a 5-cycle double cover.
منابع مشابه
Connected and Tree Domination on Goldberg and Flower Snarks
In this paper, we study the Goldberg Snarks Gk, twist Goldberg Snarks TGk, Flower snarks Fk, and show the exact value of connected and tree domination number of them. Mathematics Subject Classification: 05C35
متن کاملOn the (In)Security of SNARKs in the Presence of Oracles
In this work we study the feasibility of knowledge extraction for succinct non-interactive arguments of knowledge (SNARKs) in a scenario that, to the best of our knowledge, has not been analyzed before. While prior work focuses on the case of adversarial provers that may receive (statically generated) auxiliary information, here we consider the scenario where adversarial provers are given acces...
متن کاملOdd 2-factored snarks
A snark is a cubic cyclically 4–edge connected graph with edge chromatic number four and girth at least five. We say that a graph G is odd 2–factored if for each 2–factor F of G each cycle of F is odd. In this paper, we present a method for constructing odd 2–factored snarks. In particular, we construct two new odd 2–factored snarks that disprove a conjecture by some of the authors. Moreover, w...
متن کاملGeneration and properties of snarks
For many of the unsolved problems concerning cycles and matchings in graphs it is known that it is su cient to prove them for snarks, the class of nontrivial 3-regular graphs which cannot be 3-edge coloured. In the rst part of this paper we present a new algorithm for generating all non-isomorphic snarks of a given order. Our implementation of the new algorithm is 14 times faster than previous ...
متن کاملA family of Loupekine snarks that verifies Fulkerson’s Conjecture
In 1976, F. Loupekine created a method for constructing new snarks from already known ones. In the present work, we consider an infinite family of snarks constructed from the Petersen Graph using Loupekine’s method, and show that this family verifies Fulkerson’s Conjecture. In addition, we show that it is possible to extend this result to families constructed from snarks other than the Petersen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 23 شماره
صفحات -
تاریخ انتشار 2016